Performance Analysis of Steepest Descent-Line Search Condition Combinations in Nonlinear Least Squares Fitting of CMM Data

نویسندگان

چکیده

This paper presents a benchmarking study on the steepest descent (SD) method considering three different line search conditions including Backtracking (BC), Armijo-Backtracking (ABC) and Goldstein (GC) in nonlinear least squares fitting of measured data obtained from coordinate measuring machine (CMM). Within this scope, five primitive geometries such as circle, square, rectangle, triangle ellipse were built via 3D printer. Those then scanned with CMM to acquire their 2D profiles be fitted. To find best parameters for each geometry, approach along above-mentioned optimization method-line condition combinations employed. During process, total number function evaluations, when combination converges required tolerance, used performance metric question. With those data, created able carry out reliable evaluation. Based profiles, it has been seen that SD-ABC is fastest one. In addition, successful all while others are not. For second combination, SD-BC stands out. However, its rate only 80%, which means fails geometry. On other hand, SD-GC takes last place study. All results have shown great contribution success algorithm being used. Besides, may differ problem-to-problem. The end-users should consider these facts problems.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Least Squares Fitting of Data

This is the usual introduction to least squares fit by a line when the data represents measurements where the y–component is assumed to be functionally dependent on the x–component. Given a set of samples {(xi, yi)}i=1, determine A and B so that the line y = Ax + B best fits the samples in the sense that the sum of the squared errors between the yi and the line values Axi + B is minimized. Note...

متن کامل

SVM-Optimization and Steepest-Descent Line Search

We consider (a subclass of) convex quadratic optimization problems and analyze decomposition algorithms that perform, at least approximately, steepest-descent exact line search. We show that these algorithms, when implemented properly, are within ǫ of optimality after O(log 1/ǫ) iterations for strictly convex cost functions, and after O(1/ǫ) iterations in the general case. Our analysis is gener...

متن کامل

A Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems

In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...

متن کامل

PEDOMODELS FITTING WITH FUZZY LEAST SQUARES REGRESSION

Pedomodels have become a popular topic in soil science and environmentalresearch. They are predictive functions of certain soil properties based on other easily orcheaply measured properties. The common method for fitting pedomodels is to use classicalregression analysis, based on the assumptions of data crispness and deterministic relationsamong variables. In modeling natural systems such as s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Europan journal of science and technology

سال: 2021

ISSN: ['2148-2683']

DOI: https://doi.org/10.31590/ejosat.1012096